Generalized quadrangle GQ(4, 16) and its extensions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The triangular extensions of a generalized quadrangle of order (3,3)

We show that the triangular extension of a generalized quadrangle of order (3,3) is unique. The proof depends upon certain computer calculations.

متن کامل

Reconstructing a Generalized Quadrangle from its Distance Two Association Scheme

Payne [4] constructed an association scheme from a generalized quadrangle with a quasiregular point. We show that an association scheme with appropriate parameters and satisfying an assumption about maximal cliques must be one of these schemes arising from a generalized quadrangle.

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Binary codes of the symplectic generalized quadrangle of even order

Let q be a prime power and W (q) be the symplectic generalized quadrangle of order q. For q even, let O (respectively, E , T ) be the binary linear code spanned by the ovoids (respectively, elliptic ovoids, Tits ovoids) of W (q) and Γ be the graph defined on the set of ovoids ofW (q) in which two ovoids are adjacent if they intersect at one point. For A ∈ {E , T ,O}, we describe the codewords o...

متن کامل

Generalized Spanning Trees and Extensions

In this dissertation, network design problems where a global network interconnects at minimum cost local networks together (telecommunication, transportation networks) are considered. The generalized minimum spanning tree problem is defined on a graph where the vertex set is partitioned into clusters and a nonnegative cost is associated to each edge. It consists of finding a tree with minimum c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Doklady Mathematics

سال: 2013

ISSN: 1064-5624,1531-8362

DOI: 10.1134/s1064562413040212